| |
| description |
23 pages
|
|
We define the Möbius function for a language S being closed under
factors as the formal inverse of the characteristic series over the
set S. We derive identities in commuting and non-commutating
variables characterizing this function as a quotient of polynomials
which can be expressed as certain determinants. These determinants
in turn are obtained by some matrix related to the minimal automaton
recognizing S. Our contribution extends some recent work of Choffrut
and Goldwurm.
|
| publisher |
Stuttgart, Germany, Universität Stuttgart
|
| type |
Text
|
| Technical Report
|
| source |
ftp://ftp.informatik.uni-stuttgart.de/pub/library/ncstrl.ustuttgart_fi/TR-1997-05/TR-1997-05.pdf
|
| contributor |
Theoretische Informatik (IFI)
|
| format |
application/pdf
|
| subject |
Formal Languages (CR F.4.3)
|
| Combinatorics (CR G.2.1)
|
| relation |
Technical Report No. 1997/05
|